home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Language/OS - Multiplatform Resource Library
/
LANGUAGE OS.iso
/
oper_sys
/
isis
/
tchrprtn
< prev
next >
Wrap
Text File
|
1980-01-05
|
2KB
|
53 lines
Path: sranha!wnoc-tyo-news!ccut!sun-barr!lll-winken!sol.ctr.columbia.edu!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!agate!usenet
From: aleta@cs.cornell.edu (Aleta Ricciardi)
Newsgroups: comp.archives
Subject: [comp.sys.isis] Tech Report Announcement
Message-ID: <1991Oct12.105501.9082@agate.berkeley.edu>
Date: 12 Oct 91 10:55:01 GMT
References: <1991Oct9.152937.16896@cs.cornell.edu>
Sender: usenet@agate.berkeley.edu (USENET Administrator)
Followup-To: comp.sys.isis
Organization: Cornell University, CS Dept., Ithaca, NY
Lines: 37
Approved: adam@soda.berkeley.edu
X-Original-Date: 9 Oct 91 15: 29:37 GMT
X-Original-Newsgroups: comp.sys.isis
Archive-name: auto/comp.sys.isis/Tech-Report-Announcement
Practical Utility of Knowledge-Based Analyses :
Optimizations and Optimality for an Implementation of
Asynchronous, Fail-Stop Processes
(Extended Abstract)
Cornell TR91-1233 is available by anonymous ftp to ftp.cs.cornell.edu
(pub/TR91-1233.ps.Z). This builds on, but does not assume knowledge of,
the Failure Detection facility, described in pub/TR91-1188.ps.Z
An abstract follows :
=============
The _Group_Membership_Problem_ is concerned with propagating changes
in the membership of a group of processes to the members of that group.
A restricted version of this problem allows one to implement a fail-stop
failure model of processes in an asynchronous environment assuming a crash
failure model. While the Isis Toolkit relies on this for its Failure
Detector, the current specification of GMP sheds no light on how to
implement it. We present a knowledge-based formulation, cast as a
commit-style problem, that is not only easier to understand, but also makes
clear where optimizations to the Isis implementation are and are not
possible. In addition, the epistemic formulation allows us to use the
elegant results of knowledge-acquisition theory to discover a lower bound
on the required number of messages,construct a minimal protocol, and
discuss the tradeoffs between the message-minimal protocol and the
optimized Isis implementation.
==============
Enjoy -
aleta@cs.cornell.edu